The Partition Weight Enumerator and Bounds on Mds Codes
نویسندگان
چکیده
Maximum Distance Separable (MDS) codes are those error correction codes that meet the singleton bound, thus they have the largest minimum distance possible. The main research problem is to find an upper bound on the length of the codewords when the alphabet size and dimension of the code are fixed. This paper will present a new technique using the Partition Weight Enumerator for solving this problem in some cases.
منابع مشابه
On the Multiuser Error Probability and the Maximum Likelihood Performance of MDS Codes
MDS (e.g. Reed-Solomon) codes have many desirable properties which make them the code of choice in network scenarios and distributed coding schemes. An average binary weight enumerator of Reed-Solomon (RS) codes is derived assuming a binomial distribution of the bits in a non-zero symbol. Lower bounds on the average binary minimum distance of the ensemble of binary images of a Reed-Solomon code...
متن کاملar X iv : c s . IT / 0 50 50 54 v 1 2 1 M ay 2 00 5 The Partition Weight Enumerator of MDS Codes and its Applications
A closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary number of partitions. Using this result, some properties of MDS codes are discussed. The results are extended for the average binary image of MDS codes in finite fields of characteristic two. As an application, we study the multiuser error probability of Reed Solomon co...
متن کاملOn the Hamming distance of linear codes over a finite chain ring
Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...
متن کاملOn the Hamming distance of linear codes over a nite chain ring
Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...
متن کاملMacWilliams Identity for Codes with the Hamming and Rank Metrics
The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we first provide an alternative proof to the MacWilliams identity for linear codes with the Hamming metric. An intermediate result of our approach is that the Hamming weight enumerator of the dual of any ...
متن کامل